Analytic variations on redundancy rates of renewal processes
نویسندگان
چکیده
منابع مشابه
Analytic Variations on Redundancy Rates of Renewal Processes Analytic Variations on Redundancy Rates of Renewal Processes Analytic Variations on Redundancy Rates of Renewal Processes
Csisz ar and Shields have recently proved that the minimax redundancy for a class of renewal processes is ( p n) where n is the block length. This interesting result provides a rst non-trivial bound on redundancy for a non-parametric family of processes. The present paper provides a precise estimate up to the constant term of the redundancy rate for such sources. The asymptotic expansion is der...
متن کاملAnalytic variations on redundancy rates of renewal processes
Csiszár and Shields have proved that the minimax redundancy for a class of (stationary) renewal processes is ( ) where is the block length. This interesting result provides a nontrivial bound on redundancy for a nonparametric family of processes. The present paper gives a precise estimate of the redundancy rate for such (nonstationary) renewal sources, namely,
متن کاملVariations on Mobile Processes
The paper investigates a concurrent computation model, chi calculus, in which communications resemble cut eliminations for classical proofs. Two bisimilarities, local bisimilarity and barbed bisimilarity, on chi processes are studied and are shown to be congruence relations. The former equivalence turns out to be strictly stronger than the latter. It is shown that chi calculus is capable of mod...
متن کاملOn Reliability Prediction and Semi-renewal Processes
We analyze the notion of ‘reliability prediction’ by studying in detail a key property that is tacitly assumed to make reliability prediction possible. The analysis leads in turn to a special type of point process for which the connection of future to past can be explicitly displayed. In this type of process, the semi-renewal process, all finitedimensional distributions are completely determine...
متن کاملAnalytic Variations on the Common Subexpression Problem
Any tree can be represented in a max/ma//y compact form as a directed acyclic graph where common subtrees are factored and shared, being represented only once. Such a compaction can be effected in linear time. It is used to save storage in implementations of functional programming languages, as well as in symbolic manipulation and computer a/gebra systems. In compiling, the compaction problem i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2002
ISSN: 0018-9448
DOI: 10.1109/tit.2002.804115